Smooth point-set registration using neighboring constraints
نویسندگان
چکیده
منابع مشابه
Smooth point-set registration using neighboring constraints
We present an approach for Maximum Likelihood estimation of correspondence and alignment parameters that benefits from the representational skills of graphs. We pose the problem as one of mixture modelling within the framework of the Expectation-Maximization algorithm. Our mixture model encompasses a Gaussian density to model the point-position errors and a Bernoulli density to model the struct...
متن کاملSmooth Simultaneous Structural Graph Matching and Point-Set Registration
We present a graph matching method that encompasses both a model of structural consistency and a model of geometrical deformations. Our method poses the graph matching problem as one of mixture modelling which is solved using the EM algorithm. The solution is then approximated as a succession of assignment problems which are solved, in a smooth way, using Softassign. Our method allows us to det...
متن کاملDensity Adaptive Point Set Registration
Probabilistic methods for point set registration havedemonstrated competitive results in recent years. Thesetechniques estimate a probability distribution model of thepoint clouds. While such a representation has shownpromise, it is highly sensitive to variations in the den-sity of 3D points. This fundamental problem is primar-ily caused by changes in the sensor location...
متن کاملBi-Stage Large Point Set Registration Using Gaussian Mixture Models
Point set registration is to determine correspondences between two different point sets, then recover the spatial transformation between them. Many current methods, become extremely slow as the cardinality of the point set increases; making them impractical for large point sets. In this paper, we propose a bi-stage method called bi-GMMTPS, based on Gaussian Mixture Models and Thin-Plate Splines...
متن کاملN-View Point Set Registration: A Comparison
Recently 3 algorithms for registration of multiple partially overlapping point sets have been published by Pennec [11], Stoddart & Hilton [12] and Benjemma & Schmitt [1]. The problem is of particular interest in the building of surface models from multiple range images taken from several viewpoints. In this paper we perform a comparison of these three algorithms with respect to cpu time, ease o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2012
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2012.04.008